Connecting Red Cells in a Bicolour Voronoi Diagram
نویسندگان
چکیده
Let S be a set of n + m sites, of which n are red and have weight wR, and m are blue and weigh wB. The objective of this paper is to calculate the minimum value of the red sites’ weight such that the union of the red Voronoi cells in the weighted Voronoi diagram of S is a connected region. This problem is solved for the multiplicativelyweighted Voronoi diagram in O((n+m)2 log(nm)) time and for both the additively-weighted and power Voronoi diagram in O(nm log(nm)) time.
منابع مشابه
Geodesic Voronoi Diagrams on Parametric Surfaces
In this paper we will extend the concept of Voronoi diagrams to parameterized surfuces where distance between two points is defined as infimum over the lengths of surface paths connecting these points. We will present a method to compute Voronoi diagrams on these surfuces.
متن کاملParallel Contour Path Planning for Complicated Cavity Part Fabrication using Voronoi-based Distance Map
To generate parallel contour path for direct production of complicated cavity component, a novel path planning based on Voronoi-based distance map is presented in this paper. Firstly, the grid representation of polygonal slice is produced by hierarchical rasterization using graphics hardware acceleration and divided into Voronoi cells of contour by an exact EDT (Euclidean distance transformatio...
متن کاملBottleneck Partial-Matching Voronoi Diagrams and Applications
Given two point sets in the plane, we study the minimization of the bottleneck distance between a point set B and an equallysized subset of a point set A under translations. We relate this problem to a Voronoi-type diagram and derive polynomial bounds for its complexity that are optimal in the size of A. We devise efficient algorithms for the construction of such a diagram and its lexicographic...
متن کاملTextures with Controlled Anisotropy and Directionality
Pseudo Voronoi Tessellation via Anisotropic Meshing Our tessellation technique to represent organic texture consists of three steps: (1) elliptic or rectangular particle packing; (2) anisotropic meshing by connecting the centers of the particles; and (3) Voronoi tessellation as a dual of the anisotropic mesh. Given preferred cell sizes and directionality within a geometric domain, the technique...
متن کاملEfficient Computation of 3D Clipped Voronoi Diagram
The Voronoi diagram is a fundamental geometry structure widely used in various fields, especially in computer graphics and geometry computing. For a set of points in a compact 3D domain (i.e. a finite 3D volume), some Voronoi cells of their Voronoi diagram are infinite, but in practice only the parts of the cells inside the domain are needed, as when computing the centroidal Voronoi tessellatio...
متن کامل